Online Job Scheduling Mechanisms: How Bad are Restarts?
نویسندگان
چکیده
We investigate the power of online algorithms and mechanisms for two different classic models of preemptive online job scheduling. These two models are resumptive and non-resumptive job scheduling. The distinction is when we decide to allocate a previously preempted job. In the resumptive model we resume the job’s allocation as if no preemption has occurred. In the non-resumptive model the job’s allocation is restarted. We perform this comparison in two different models of standard and metered. We provide several Mechanisms and lower bounds for these different models.
منابع مشابه
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competitive ratios belo...
متن کاملOnline S heduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to determine a single-processor, non-preemptive schedule of these jobs that maximizes the number of completed jobs. In the online version, each job arrives at its release time. We give two online algorithms with competiti...
متن کاملOnline scheduling in a parallel batch processing system to minimize makespan using restarts
We consider an online scheduling problem in a parallel batch processing system with jobs in a batch being allowed to restart. Online means that jobs arrive over time, and all jobs’ characteristics are unknown before their arrival times. A parallel batch processing machine can handle up to several jobs simultaneously. All jobs in a batch start and complete at the same time. The processing time o...
متن کاملJob Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
In previous work we introduced a simple constraint model that combined generic AI strategies and techniques (weighted degree heuristic, geometric restarts, nogood learning from restarts) with naive propagation for job shop and open shop scheduling problems. Here, we extend our model to handle two variants of the job shop scheduling problem: job shop problems with setup times; and job shop probl...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کامل